A Usable Reachability Analyser
نویسنده
چکیده
Reachability analysis consists in checking if a state satisfying some property is reachable. In this paper a solution to the problem of generating formulae expressing reachability properties for concrete models is suggested. The traditional methods either require the user to input the formula manually, which can be very tedious and error-prone, or automatically generate formulae for some fixed set of common properties, which does not allow one to check custom properties. The proposed approach allows the user to write a concise abstract specification of the property in a specially developed language REACH, which is then automatically expanded into a formula for a concrete model. Its usefulness is demonstrated on several case studies.
منابع مشابه
Anna-Maria - Application of New Net-Theoretic Analysis Methods in Maria - a Modular Reachability Analyser
متن کامل
A Purpose-Directed Reachability Analysis Approach
The paper presents a new approach for reachability analysis. This is based on analysis purposes that are established by an analyser expert. The analysis purposes address system specification parts that may be ‘suspected’ of presenting non-reachable states and thus the analysis is especially focused on. Such information about ‘suspicious’ specification parts to be checked is based on special kno...
متن کاملPropositional Temporal Linear Logic and its Application to Concurrent Systems
In computer science, concepts of resource such as data consumption and of time such as execution time are very important. Logical systems which can treat them have been applied in that field. Linear logic has been called a resource conscious logic. The expressive power is enough to describe a dynamic change in process environments. However, linear logic is not enough to treat a dynamic change i...
متن کاملOptimising Enabling Tests and Unfoldings of Algebraic System Nets
Reachability analysis and simulation tools for high-level nets spend a significant amount of the computing time in performing enabling tests, determining the assignments under which transitions are enabled. Unlike the majority of earlier work on computing enabled transition bindings, the techniques presented in this paper are highly independent of the algebraic operations supported by the high-...
متن کاملMaria: Modular Reachability Analyser for Algebraic System Nets
Maria performs simulation, exhaustive reachability analysis and on-the-fly LTL model checking of high-level Petri nets with fairness constraints. The algebra contains powerful built-in data types and operations. Models can be exported to low-level Petri nets and labelled transition systems. Translator programs allow Maria to analyse transition systems as well as distributed computer programs wr...
متن کامل